Regression Testing based on Hamming Distance and Code Coverage
نویسندگان
چکیده
منابع مشابه
Genetic code, hamming distance and stochastic matrices.
In this paper we use the Gray code representation of the genetic code C=00, U=10, G=11 and A=01 (C pairs with G, A pairs with U) to generate a sequence of genetic code-based matrices. In connection with these code-based matrices, we use the Hamming distance to generate a sequence of numerical matrices. We then further investigate the properties of the numerical matrices and show that they are d...
متن کاملError masking in compact testing based on the Hamming code and its modifications
Probability that an invalid sequence at an output of a device under test is not detected(error masking) is the measure of the eflectiveness ofcompact testing methods. This paper evaluates and analyses the probability distribution of error masking for compact testing by exploiting the characteristics both of the Hamming code (i.e., the signature analysis) and of some modi$ed Hamming codes. To st...
متن کاملDynamic Component Safety Analysis: A Regression Based Code Coverage Approach
In dynamic software updates there exists a different level of possible behavior change. The easiest way of transforming an application is to modify the implementation of a whole method body, i.e., updating the method body to a new version without disturbing the overall application. A next step regarding arbitrary updates is the ability to change the signature of a method, along with the interna...
متن کاملImage Steganography Based on Hamming Code and Edge Detection
In this paper a novel algorithm which is based on hamming code and 2 k correction is proposed. The new method also utilizes canny edge detection and coherent bit length. Firstly, canny edge detector is applied to detect the edge of cover image and only edge pixels are selected for embedding payload. In order to enhance security, the edge pixels are scrambled. Then hamming encoding is practiced ...
متن کاملOn Computing the Hamming Distance
Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/21292-4308